1-String CZ-Representation of Planar Graphs
نویسندگان
چکیده
In this paper, we prove that every planar 4-connected graph has a CZ-representation—a string representation using paths in a rectangular grid that contain at most one vertical segment. Furthermore, two paths representing vertices u, v intersect precisely once whenever there is an edge between u and v. The required size of the grid is n× 2n.
منابع مشابه
Order-Preserving 1-String Representations of Planar Graphs
This paper considers 1-string representations of planar graphs that are order-preserving in the sense that the order of crossings along the curve representing vertex v is the same as the order of edges in the clockwise order around v in the planar embedding. We show that this does not exist for all planar graphs (not even for all planar 3-trees), but show existence for some subclasses of planar...
متن کامل1-String B_2-VPG Representation of Planar Graphs
In this paper, we prove that every planar graph has a 1-string B2-VPG representation—a string representation using paths in a rectangular grid that contain at most two bends. Furthermore, two paths representing vertices u, v intersect precisely once whenever there is an edge between u and v. 1998 ACM Subject Classification I.3.5 Computational Geometry and Object Modeling
متن کاملBeyond-Planar Graphs: Algorithmics and Combinatorics
This report summarizes Dagstuhl Seminar 16452 “Beyond-Planar Graphs: Algorithmics and Combinatorics” and documents the talks and discussions. The seminar brought together 29 researchers in the areas of graph theory, combinatorics, computational geometry, and graph drawing. The common interest was in the exploration of structural properties and the development of algorithms for so-called beyond-...
متن کاملString graphs of k-bend paths on a grid
We investigate the class of vertex intersection graphs of paths on a grid, and specifically consider the subclasses that are obtained when each path in the representation has at most k bends (turns). We call such a subclass the Bk-VPG graphs, k ≥ 0. If the number k of bends is not restricted, then the VPG graphs are shown to be equivalent to the well-known class of string graphs, namely, the in...
متن کامل1-string B1-VPG-representations of planar partial 3-trees and some subclasses
Planar partial 3-trees are subgraphs of those planar graphs obtained by repeatedly inserting a vertex of degree 3 into a face. In this paper, we show that planar partial 3-trees have 1-string B1-VPG representations, i.e., representations where every vertex is represented by an orthogonal curve with at most one bend, every two curves intersect at most once, and intersections of curves correspond...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1409.5816 شماره
صفحات -
تاریخ انتشار 2014